175 research outputs found

    Words and Rules Revisited: Reassessing the Role of Construction and Memory in Language

    Get PDF

    Phonological (un)certainty weights lexical activation

    Full text link
    Spoken word recognition involves at least two basic computations. First is matching acoustic input to phonological categories (e.g. /b/, /p/, /d/). Second is activating words consistent with those phonological categories. Here we test the hypothesis that the listener's probability distribution over lexical items is weighted by the outcome of both computations: uncertainty about phonological discretisation and the frequency of the selected word(s). To test this, we record neural responses in auditory cortex using magnetoencephalography, and model this activity as a function of the size and relative activation of lexical candidates. Our findings indicate that towards the beginning of a word, the processing system indeed weights lexical candidates by both phonological certainty and lexical frequency; however, later into the word, activation is weighted by frequency alone.Comment: 6 pages, 4 figures, accepted at: Cognitive Modeling and Computational Linguistics (CMCL) 201

    Generative linguistics within the cognitive neuroscience of language

    Full text link

    Predicative Possessives Relational Nouns and Floating Quantifiers

    Get PDF
    Green (1971) notes the apparent unacceptability of certain quantificational expressions as possessors of singular head nouns. We provide data from a range of English dialects to show that such constructions are not straightforwardly unacceptable, but there are a number of restrictions on their use. We build on Kayne’s (1993; 1994) analysis of English possessives in conjunction with considerations on floating quantifiers to explain both the types of possessive that are permitted in the relevant dialects and their distribution, which is restricted to predicative position

    Experimental investigations of ambiguity: the case of most

    Get PDF
    In the study of natural language quantification, much recent attention has been devoted to the investigation of verification procedures associated with the proportional quantifier most. The aim of these studies is to go beyond the traditional characterization of the semantics of most, which is confined to explicating its truth-functional and presuppositional content as well as its combinatorial properties, as these aspects underdetermine the correct analysis of most. The present paper contributes to this effort by presenting new experimental evidence in support of a decompositional analysis of most according to which it is a superlative construction built from a gradable predicate many or much and the superlative operator -est (Hackl, in Nat Lang Semant 17:63–98, 2009). Our evidence comes in the form of verification profiles for sentences like Most of the dots are blue which, we argue, reflect the existence of a superlative reading of most. This notably contrasts with Lidz et al.’s (Nat Lang Semant 19:227–256, 2011) results. To reconcile the two sets of data, we argue, it is necessary to take important differences in task demands into account, which impose limits on the conclusions that can be drawn from these studies

    Minimalist C/case

    Get PDF
    This article discusses A-licensing and case from a minimalist perspective, pursuing the idea that argument NPs cyclically enter a number of A-relations, rather than just a single one, resulting in event-licensing, case-licensing and phi-licensing. While argument case commonly reflects Voice/v-relations, canonical A-movement is driven by higher elements, either in the C-T system or in a superordinate v-system (in ECM constructions). In addition, there is a distinction to be drawn between the triggering of A-movement, by for example C, and the licensing of the landing site, by for instance T, C-probing leading to tucking-in into Spec-T. Much of the evidence presented comes from quirky case constructions in Icelandic and from ECM and raising constructions in Icelandic and English. It is argued that T in ECM constructions inherits phi-licensing from the matrix v, regardless of the case properties of v
    corecore